A flux-corrected transport algorithm for handling the close-packing limit in dense suspensions
نویسندگان
چکیده
منابع مشابه
A flux-corrected transport algorithm for handling the close-packing limit in dense suspensions
Convection of a scalar quantity by a compressible velocity field may give rise to unbounded solutions or nonphysical overshoots at the continuous and discrete level. In this paper, we are concerned with solving continuity equations that govern the evolution of volume fractions in Eulerian models of disperse two-phase flows. An implicit Galerkin finite element approximation is equipped with a fl...
متن کاملA multistep flux-corrected transport scheme
A multistep flux-corrected transport (MFCT) scheme is developed to achieve conservative and monotonic tracer transports for multistep dynamical cores. MFCT extends Zalesak twotime level scheme to any multistep time-differencing schemes by including multiple highorder fluxes in the antidiffusive flux, while computing the two-time level low-order monotone solution. The multistep time-differencing...
متن کاملApplication of Flux Corrected Transport for Multicomponent Reactive Transport Modeling
Reactive transport describes the coupling among flow, transport and chemical reactions occurring in porous media; and therefore it is important in areas such as aquifer remediation, groundwater contamination, geochemical reaction modeling and CO2 sequestration. Due to the large time scales involved and/or the lack of accessibility to the subsurface, in most of these studies an adequate represen...
متن کاملImplicit flux-corrected transport algorithm for finite element simulation of the compressible Euler equations
The flux-corrected-transport paradigm is generalized to implicit finite element schemes for hyperbolic systems. A conservative flux decomposition procedure is proposed for both convective and diffusive terms. A mathematical theory for positivitypreserving schemes is reviewed. A nonoscillatory low-order method is constructed by elimination of negative off-diagonal entries of the discrete transpo...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2012
ISSN: 0377-0427
DOI: 10.1016/j.cam.2011.10.019